Perfect Z2Z4-linear codes in Steganography
نویسندگان
چکیده
Steganography is an information hiding application which aims to hide secret data imperceptibly into a commonly used media. Unfortunately, the theoretical hiding asymptotical capacity of steganographic systems is not attained by algorithms developed so far. In this paper, we describe a novel coding method based on Z2Z4-linear codes that conforms to ±1-steganography, that is secret data is embedded into a cover message by distorting each symbol by one unit at most. This method solves some problems encountered by the most efficient methods known today, based on ternary Hamming codes. Finally, the performance of this new technique is compared with that of the mentioned methods and with the well-known theoretical upper bound.
منابع مشابه
Perfect Z2Z4-linear codes applied to steganography
Steganography aims to hide secret data imperceptibly into a cover object. We describe a novel method based on Z2Z4-linear codes in which data is embedded by distorting each cover symbol by one unit at most (±1-steganography). This method solves the problem encountered by the most efficient methods known today, concerning the treatment of boundary values. Moreover, a generalization of the produc...
متن کاملProduct perfect Z2 Z4-linear codes in steganography
Product perfect codes have been proven to enhance the performance of the F5 steganographic method, whereas perfect Z2Z4-linear codes have been recently introduced as an efficient way to embed data, conforming to the ±1-steganography. In this paper, we present two steganographic methods. On the one hand, a generalization of product perfect codes is made. On the other hand, this generalization is...
متن کاملOn the automorphism groups of the Z2 Z4 -linear 1-perfect and Preparata-like codes
We consider the symmetry group of a Z2Z4-linear code with parameters of a 1-perfect, extended 1-perfect, or Preparata-like code. We show that, provided the code length is greater than 16, this group consists only of symmetries that preserve the Z2Z4 structure. We find the orders of the symmetry groups of the Z2Z4-linear (extended) 1-perfect codes.
متن کاملConstruction of New Completely Regular Z2Z4-linear Codes from Old
A code C is said to be Z2Z4-additive if its coordinates can be partitioned into two subsets X and Y , in such a way that the punctured code of C obtained by removing the coordinates outside X (or, respectively, Y ) is a binary linear code (respectively, a quaternary linear code). The binary image of a Z2Z4-additive code, through the Gray map, is a Z2Z4-linear code, which is not always linear. G...
متن کاملℤ2ℤ4-additive perfect codes in Steganography
Steganography is an information hiding application which aims to hide secret data imperceptibly into a cover object. In this paper, we describe a novel coding method based on Z2Z4-additive codes in which data is embedded by distorting each cover symbol by one unit at most (±1-steganography). This method is optimal and solves the problem encountered by the most efficient methods known today, con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1002.0026 شماره
صفحات -
تاریخ انتشار 2010